Which linear transformations have isomorphic hyperinvariant subspace lattices?
نویسندگان
چکیده
منابع مشابه
Linear Transformations with Characteristic Subspaces That Are Not Hyperinvariant
If f is an endomorphism of a finite dimensional vector space over a field K then an invariant subspace X ⊆ V is called hyperinvariant (respectively, characteristic) if X is invariant under all endomorphisms (respectively, automorphisms) that commute with f . According to Shoda (Math. Zeit. 31, 611–624, 1930) only if |K| = 2 then there exist endomorphisms f with invariant subspaces that are char...
متن کاملDarboux Transformations for Linear Operators on Two Dimensional Regular Lattices
Darboux transformations for linear operators on regular two dimensional lattices are reviewed. The six point scheme is considered as the master linear problem, whose various specifications, reductions, and their sublattice combinations lead to other linear operators together with the corresponding Darboux transformations. The second part of the review deals with multidimensional aspects of (bas...
متن کاملDo Isomorphic Structural Matrix Rings Have Isomorphic Graphs?
We first provide an example of a ring R such that all possible 2 × 2 structural matrix rings over R are isomorphic. However, we prove that the underlying graphs of any two isomorphic structural matrix rings over a semiprime Noetherian ring are isomorphic, i.e. the underlying Boolean matrix B of a structural matrix ring M(B,R) over a semiprime Noetherian ring R can be recovered, contrary to the ...
متن کاملModulo Scheduling with Isomorphic Control Transformations
This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches introduce multiple execution paths, it is diicult for a global scheduler to keep track of the various...
متن کاملA Groupoid of Isomorphic Data Transformations
As a variation on the known theme of Gödel numberings, isomorphisms defining data type transformations in a strongly typed functional language are organized as a finite groupoid using a higher order combinator language that unifies popular data types as diverse as natural numbers, finite sequences, digraphs, hypergraphs and finite permutations with more exotic ones like hereditarily finite func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90177-c